Efficient polynomial reduction
نویسندگان
چکیده
H–bases are bases for polynomial ideals, characterized by the fact that their homogeneous leading terms are a basis for the associated homogeneous ideal. In the computation of H–bases without term orders, an important task is to determine the orthogonal projection of a homogeneous polynomial to certain subspaces of homogeneous polynomials with respect to a given inner product. One way of doing so is to use an orthogonal basis of the subspace. In this paper, we present and study a method to efficiently compute such a basis for a particular but important inner product. Dedicated to Mariano Gasca, a very special friend and collaborator, on the occasion of his sixtieth birthday
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAn efficient symmetric polynomial-based key establishment protocol for wireless sensor networks
An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, ...
متن کاملPolynomials: a new tool for length reduction in binary discrete convolutions
Efficient handling of sparse data is a key challenge in Computer Science. Binary convolutions, such as polynomial multiplication or the Walsh Transform are a useful tool in many applications and are efficiently solved. In the last decade, several problems required efficient solution of sparse binary convolutions. Both randomized and deterministic algorithms were developed for efficiently comput...
متن کاملEfficient Delay Characterization Method to Obtain the Output Waveform of Logic Gates Considering Glitches
Accurate delay calculation of circuit gates is very important in timing analysis of digital circuits. Waveform shapes on the input ports of logic gates should be considered, in the characterization phase of delay calculation, to obtain accurate gate delay values. Glitches and their temporal effect on circuit gate delays should be taken into account for this purpose. However, the explosive numbe...
متن کاملNumerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method
In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.
متن کاملState space reduction using Predicate Filters
In a previous paper, we presented a technique called finite trace covers, in which a program is represented by a set of partial orders. We also presented classes of reachability properties that could be checked in time that is polynomial in the size of the trace cover. A deficiency of this approach was that it did not reduce the complexity of checking properties that did not belong to an effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Comput. Math.
دوره 26 شماره
صفحات -
تاریخ انتشار 2007